Flipping Triangles!
نویسندگان
چکیده
منابع مشابه
Flipping Triangles and Rectangles
For any graph G, it is obvious that χ(G) ≥ ω(G), but whether χ(G) can be bounded from above by a function of ω(G) is not at all clear. Recall that the two numbers are equal for every induced subgraph of a perfect graph. Thus the ratio of the chromatic number to the clique number of a graph is often studied as a measure of its “imperfection”; see for example Dumitrescu and Jiang (2010) for some ...
متن کاملFlipping HCI
This paper presents the results of two studies involving “flipping the classroom”. Teaching material was delivered via interactive “e-lectures”, allowing face-to-face sessions to focus instead on practice. The e-lectures were designed according to standard usability principles coupled with recent research into the effect of interactivity on learning. The effectiveness of the use of e-lectures w...
متن کاملFlipping Pebbles
We are trying to understand exactly how complicated these orbits are. A moment’s thought reveals that the toggle operation is reversible, so the orbit of any sequence must be a cycle. A few computational experiments suggest that the length of the cycle associated with a sequence of length n is about 2 and thus has exponential length. This leads to a natural computational question that we will r...
متن کاملFlipping Riboswitches
Riboswitches are common cis-acting regulatory elements in bacteria. They are made of nascent RNA that changes its conformation in response to direct binding of cognate metabolites. The publication of five high-resolution crystal structures provides a comprehensive view of how riboswitches sense their ligands and points to new challenges in this emerging field.
متن کاملFrustrated triangles
A triple of vertices in a graph is a frustrated triangle if it induces an odd number of edges. We study the set Fn ⊂ [0, n 3 ] of possible number of frustrated triangles f (G) in a graph G on n vertices. We prove that about two thirds of the numbers in [0, n3/2] cannot appear in Fn, and we characterise the graphs G with f (G) ∈ [0, n3/2]. More precisely, our main result is that, for each n ≥...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The College Mathematics Journal
سال: 2009
ISSN: 0746-8342,1931-1346
DOI: 10.1080/07468342.2009.11922359